Computational Divided Differencing and Divided-Difference Arithmetics

نویسندگان

  • Thomas W. Reps
  • Louis B. Rall
چکیده

Tools for computational differentiation transform a program that computes a numerical function F(x) into a related program that computes F ′(x) (the derivative of F). This paper describes how techniques similar to those used in computational-differentiation tools can be used to implement other program transformations—in particular, a variety of transformations for computational divided differencing. We discuss how computational divided-differencing techniques could lead to faster and more robust programs in scientific and graphics applications. We also describe how these ideas relate to the numerical-finite-differencing techniques that motivated Robert Paige’s work on finite differencing of set-valued expressions in SETL programs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some notes on applying computational divided differencing in optimization

We consider the problem of accurate computation of the finite difference f(x+ s)− f(x) when ‖s‖ is very small. Direct evaluation of this difference in floating point arithmetic succumbs to cancellation error and yields 0 when s is sufficiently small. Nonetheless, accurate computation of this finite difference is required by many optimization algorithms for a “sufficient decrease” test. Reps and...

متن کامل

Numerical Solution of the Generalized Burgers-Huxley Equation by Exponential Time Differencing Scheme

Numerical solutions of nonlinear partial differential equations, such as the generalized and extended Burgers-Huxley equations which combine effects of advection, diffusion, dispersion and nonlinear transfer are considered in this paper. Such system can be divided into linear and nonlinear parts, which allow the use of two numerical approaches. Higher order finite difference schemes are employe...

متن کامل

Model Theory of Ultrafinitism I: Fuzzy Initial Segments of Arithmetics

This article is the first of an intended series of works on the model theory of Ultrafinitism. It is roughly divided into two parts. The first one addresses some of the issues related to ultrafinitistic programs, as well as some of the core ideas proposed thus far. The second part of the paper presents a model of ultrafinitistic arithmetics based on the notion of fuzzy initial segments of the s...

متن کامل

Two Efficient Derivative-Free Iterative Methods for Solving Nonlinear Systems

In this work, two multi-step derivative-free iterative methods are presented for solving system of nonlinear equations. The new methods have high computational efficiency and low computational cost. The order of convergence of the new methods is proved by a development of an inverse first-order divided difference operator. The computational efficiency is compared with the existing methods. Nume...

متن کامل

Digital Image Steganography using Nine-Pixel Differencing and Modified LSB Substitution

To provide higher embedding capacity without sacrificing the imperceptibility, a novel steganographic technique based on nine-pixel differencing with modified Least Significant Bit (LSB) substitution is proposed. The image is divided into 3×3 non-overlapping blocks. In each block the average difference value is calculated. Based on this value the block is classified to fall into one of the four...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Higher-Order and Symbolic Computation

دوره 16  شماره 

صفحات  -

تاریخ انتشار 2003